Combinatorial and Random Walk Hypergraph Laplacian EigenmapsCombinatorial and Random Walk Hypergraph Laplacian Eigenmaps
نویسندگان
چکیده
منابع مشابه
From the Long Jump Random Walk to the Fractional Laplacian
This note illustrates how a simple random walk with possibly long jumps is related to fractional powers of the Laplace operator. The exposition is elementary and self-contained. ‘‘Le discese ardite e le risalite su nel cielo aperto e poi giù il deserto e poi ancora in alto con un grande salto...’’ (Lucio Battisti, ‘‘Io vorrei... non vorrei... ma se vuoi...’’) The purpose of this note, which is ...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملThe Laplacian of a uniform hypergraph
In this paper, we investigate the Laplacian, i.e., the normalized Laplacian tensor of a k-uniform hypergraph. We show that the real parts of all the eigenvalues of the Laplacian are in the interval [0, 2], and the real part is zero (respectively two) if and only if the eigenvalue is zero (respectively two). All the H+-eigenvalues of the Laplacian and all the smallest H+-eigenvalues of its sub-t...
متن کاملHypergraph p-Laplacian: A Differential Geometry View
The graph Laplacian plays key roles in information processing of relational data, and has analogies with the Laplacian in differential geometry. In this paper, we generalize the analogy between graph Laplacian and differential geometry to the hypergraph setting, and propose a novel hypergraph pLaplacian. Unlike the existing two-node graph Laplacians, this generalization makes it possible to ana...
متن کاملRandom Walks in Hypergraph
Random walks on graphs have been extensively used for a variety of graph-based problems such as ranking vertices, predicting links, recommendations, and clustering. However, many complex problems mandate a high-order graph representation to accurately capture the relationship structure inherent in them. Hypergraphs are particularly useful for such models due to the density of information stored...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Machine Learning and Computing
سال: 2015
ISSN: 2010-3700
DOI: 10.18178/ijmlc.2015.5.6.553